-
1 block-recursive matching algorithm
abbr. BRMAалгоритм поблочного согласования с рекурсивной обработкой элементов изображения (алгоритм межкадрового кодирования с компенсацией перемещений, являющийся комбинацией алгоритмов поблочного согласования и рекурсивной обработки элементов изображения); см. block-matching algorithmАнгло-русский словарь промышленной и научной лексики > block-recursive matching algorithm
-
2 block-matching algorithm
abbr. BMAАнгло-русский словарь промышленной и научной лексики > block-matching algorithm
См. также в других словарях:
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Motion estimation — is the process of determining motion vectors that describe the transformation from one 2D image to another; usually from adjacent frames in a video sequence. It is an ill posed problem as the motion is in three dimensions but the images are a… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
List of statistics topics — Please add any Wikipedia articles related to statistics that are not already on this list.The Related changes link in the margin of this page (below search) leads to a list of the most recent changes to the articles listed below. To see the most… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new … Wikipedia
Mathematics of Sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N}), so that each … Wikipedia
Adel Sedra — is an Egyptian electrical engineer whose research specialization is microelectronics, with particular emphasis on applications in communication and instrumentation systems. He received his bachelor of science in electrical engineering from Cairo… … Wikipedia